Several protocol efficiency metrics (e.g., scalability, search success rate,routing reachability and stability) depend on the capability of preservingstructure even over the churn caused by the ad-hoc nodes joining or leaving thenetwork. Preserving the structure becomes more prohibitive due to thedistributed and potentially uncooperative nature of such networks, as in thepeer-to-peer (P2P) networks. Thus, most practical solutions involveunstructured approaches while attempting to maintain the structure at variouslevels of protocol stack. The primary focus of this paper is to investigateconstruction and maintenance of scale-free topologies in a distributed mannerwithout requiring global topology information at the time when nodes join orleave. We consider the uncooperative behavior of peers by limiting the numberof neighbors to a pre-defined hard cutoff value (i.e., no peer is a major hub),and the ad-hoc behavior of peers by rewiring the neighbors of nodes leaving thenetwork. We also investigate the effect of these hard cutoffs and rewiring ofad-hoc nodes on the P2P search efficiency.
展开▼
